Non-Omniscience, Probabilistic Inference, and Metamathematics
نویسنده
چکیده
We suggest a tractable algorithm for assigning probabilities to sentences of firstorder logic and updating those probabilities on the basis of observations. The core technical difficulty is relaxing the constraints of logical consistency in a way that is appropriate for bounded reasoners, without sacrificing the ability to make useful logical inferences or update correctly on evidence. Using this framework, we discuss formalizations of some issues in the epistemology of mathematics. We show how mathematical theories can be understood as latent structure constraining physical observations, and consequently how realistic observations can provide evidence about abstract mathematical facts. We also discuss the relevance of these ideas to general intelligence.
منابع مشابه
Logical omniscience and rational choice
It is well-known that usual doxastic models (epistemic logic, probability) suffer from strong idealizations. By extension, models of decision making that elaborate on these doxastic models (e.g., models of choice under set-theoretic uncertainty ([LR85], chap.13) and the expected utility model) inherit these idealizations. To improve doxastic models is therefore an important aspect of bounded ra...
متن کاملLogics for resource-bounded agents
In this thesis, I criticise traditional epistemic logics based on possible worlds semantics, inspired by Hintikka, as a framework for representing the beliefs and knowledge of agents. The traditional approach suffers from the logical omniscience problem: agents are modelled as knowing all consequences of their knowledge, which is not an admissible assumption when modelling real-world reasoning ...
متن کاملTracking truth: Knowledge and conditionals in the context of branching time
Van Benthem has recently remarked that Nozick’s notion of knowledge via ‘tracking the truth’ constitutes ‘[...] an open challenge’ to logicians. It is easy to see that its adoption will block laws such as Distribution or Introspection. But are there any valid inference patterns left? Given some plausible background logic of belief and counterfactuals, what is the complete set of validities of N...
متن کاملWeihrauch Degrees, Omniscience Principles and Weak Computability
In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice with the disjoint union of multi-valued functions as greatest ...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014